|
In graph theory, a random geometric graph (RGG) is the mathematically simplest spatial network, namely an undirected graph constructed by randomly placing ''N'' nodes in some metric space (according to a specified probability distribution) and connecting two nodes by a link if and only if their distance is in a given range, e.g. smaller than a certain neighborhood radius, ''r''. A real-world application of RGGs is the modeling of ad hoc networks. == Examples == * In 1 dimension, one can study RGGs on a line of unit length (open boundary condition) or on a circle of unit circumference. * In 2 dimensions, an RGG can be constructed by choosing a flat unit square The simplest choice for the node distribution is to sprinkle them uniformly and independently in the embedding space. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Random geometric graph」の詳細全文を読む スポンサード リンク
|